Pii: S0166-4328(00)00387-9
نویسنده
چکیده
Apamin blocks SK channels responsible for long-lasting hyperpolarization following the action potential. Using an olfactory associative task, the effect of an intracerebroventricular 0.3 ng apamin injection was tested on learning and memory. Apamin did not modify the learning of the procedure side of the task or the learning of the odor-reward association. To test reference memory specifically, the rats were trained on a new odor-association problem using the same procedure (acquisition session), and they were tested for retention 24 h later. Apamin injected before or after the acquisition session improved retention of the valence of a new odor pair. Apamin injected before the retention session did not affect the retrieval of the new valence. Thus, the results indicate that the blockage of apamin-sensitive SK channels facilitate consolidation on new-odor-reward association. © 2001 Elsevier Science B.V. All rights reserved.
منابع مشابه
Pii: S0166-4328(00)00333-8
The effects of several N-methyl-D-aspartate (NMDA) receptorand sigma receptor-related compounds on the discriminative stimulus effects of phencyclidine (PCP) were examined in rats trained to discriminate PCP (1.5 mg/kg, i.p.) from saline under a two-lever fixed ratio 20 schedule of food reinforcement. PCP produced a dose-dependent increase in PCP-appropriate responding. A non-competitive NMDA r...
متن کاملPii: S0166-4328(00)00204-7
It has previously been shown that the reinforcing and dependence-producing properties of nicotine depend to a great extent on activation of nicotinic receptors within the ventral tegmental area (VTA), i.e. the site of origin of the mesolimbocortical dopaminergic projection. Based on the data reviewed in the present study, it is suggested that nicotine by stimulating presynaptic a7 nicotinic rec...
متن کاملIndependent Spanning Trees with Small Depths in Iterated Line Digraphs
We show that the independent spanning tree conjecture on digraphs is true if we restrict ourselves to line digraphs. Also, we construct independent spanning trees with small depths in iterated line digraphs. From the results, we can obtain independent spanning trees with small depths in de Bruijn and Kautz digraphs that improve the previously known upper bounds on the depths.
متن کاملReload cost problems: minimum diameter spanning tree
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of di(erent colors. We consider the problem of 0nding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On th...
متن کاملPii: S0045-7825(98)00387-9
The sweeping process, introduced some time ago by the author with motivation in plasticity theory, today remains an object of mathematical research. It is considered in this paper as the prototype of an evolution conditioned by inequality constraints. Since the governing differential requirements are only of order one with respect to time, this provides a simplified setting for analysing some n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001